Some Sharp Upper Bounds on the Spectral Radius of Graphs
نویسندگان
چکیده
In this paper, we first give a relation between the adjacency spectral radius and the Q-spectral radius of a graph. Then using this result, we further give some new sharp upper bounds on the adjacency spectral radius of a graph in terms of degrees and the average 2-degrees of vertices. Some known results are also obtained.
منابع مشابه
Sharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملOn Zagreb Energy and edge-Zagreb energy
In this paper, we obtain some upper and lower bounds for the general extended energy of a graph. As an application, we obtain few bounds for the (edge) Zagreb energy of a graph. Also, we deduce a relation between Zagreb energy and edge-Zagreb energy of a graph $G$ with minimum degree $delta ge2$. A lower and upper bound for the spectral radius of the edge-Zagreb matrix is obtained. Finally, we ...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملAn Upper Bound on the Spectral Radius of Weighted Graphs
We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues of a graph are the eigenvalues of its adjacency matrix. We obtain another upper bound which is sharp on the spectral radius of the adjacency matrix and compare with some known upper bounds with the help of some examples of graphs. We also characterize graphs for which the bound is attained.
متن کاملBounds of the Spectral Radius and the Nordhaus-Gaddum Type of the Graphs
The Laplacian spectra are the eigenvalues of Laplacian matrix L(G) = D(G) - A(G), where D(G) and A(G) are the diagonal matrix of vertex degrees and the adjacency matrix of a graph G, respectively, and the spectral radius of a graph G is the largest eigenvalue of A(G). The spectra of the graph and corresponding eigenvalues are closely linked to the molecular stability and related chemical proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007